-
1 parent vertex
Большой англо-русский и русско-английский словарь > parent vertex
-
2 parent vertex
Математика: родительская вершина (графа) -
3 parent vertex
родительская вершина, родительский узел -
4 parent vertex
-
5 vertex
-
6 vertex
1) вершина (1. наивысшая точка 2. наиболее удалённая от основания точка геометрической фигуры или тела 3. точка пересечения трёх или более граней многогранника 4. точка пересечения двух сторон многоугольника 5. вершина графа, узел графа) || вершинный2) узел схемы; узел цепи3) вертекс ( точка небесной сферы)•- adjacent vertex
- chief vertex
- dangling vertex
- daughter vertex
- drain vertex
- even vertex
- exterior vertex
- final vertex
- graph vertex
- incident vertex
- initial vertex
- inner vertex
- irreducible vertex
- isolated vertex
- mating vertex
- multivalent vertex
- odd vertex
- parent vertex
- pendant vertex
- saturated vertex
- source vertex
- suspended vertex
- terminal vertex
- unsaturated vertex -
7 родительская вершина
Большой англо-русский и русско-английский словарь > родительская вершина
-
8 root
корень имя прилагательное: имя существительное:корнеплод (root, root-crop)основатель рода (progenitor, root)глагол:пускать корни (take root, root, strike root)болеть за кого-л. (root, root for)
См. также в других словарях:
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Breadth-first search — Infobox Algorithm class=Search Algorithm Order in which the nodes are expanded data=Graph time=O(|V|+|E|) = O(b^d) space=O(|V|+|E|) = O(b^d) optimal=yes (for unweighted graphs) complete=yesIn graph theory, breadth first search (BFS) is a graph… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
cosmos — /koz meuhs, mohs/, n., pl. cosmos, cosmoses for 2, 4. 1. the world or universe regarded as an orderly, harmonious system. 2. a complete, orderly, harmonious system. 3. order; harmony. 4. any composite plant of the genus Cosmos, of tropical… … Universalium
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Uniform polytope — A uniform polytope is a vertex transitive polytope made from uniform polytope facets. A uniform polytope must also have only regular polygon faces.Uniformity is a generalization of the older category semiregular, but also includes the regular… … Wikipedia
Top Trees — The Top Tree is a binary tree based data structure for unrooted dynamic trees which is used mainly for carrying out various path related operations, it allows simple Divide and conquer algorithms. It has since been augmented to maintain… … Wikipedia
Skeletal animation — Skeletal animation, sometimes referred to as rigging, is a technique in computer animation, particularly in the animation of vertebrates, in which a character is represented in two parts: a surface representation used to draw the character… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
